Dynamic Assignment with User Information in Multimodal Networks

Dynamic Resiliency to User Assignment

Nowadays organizations face fast organizational changes and employee turnover, e.g user are unavailable or they change roles because of a promotion, that might compromise the execution of a business process instance and, thus, the achievement of organizational business goals. In this paper, we investigate the problem of dynamic resiliency to changes in the assignment of users to roles. The goal...

B-Dynamic: An Efficient Algorithm for Dynamic User Equilibrium Assignment in Activity-Travel Networks

Multi-dimensional choice in DTA for example, a combined model of activity location, time of participation, duration, and route choice decisions results in exponentially increasing choice alternatives. Any efficient algorithm for solving the multi-dimensional DTA problem must avoid enumeration of alternatives. In this paper an algorithm that does not enumerate paths is presented. The algorithm i...

A Frequency Based Transit Model for Dynamic Traffic Assignment to Multimodal Networks

A Within-day Dynamic Traffic Assignment Logit Model to Multimodal Urban Networks

In this paper, with reference to congested multimodal urban networks, within-day dynamic traffic assignment is formalized as a fixed-point problem in terms of arc flow and transit frequency temporal profiles. The main innovation is to represent transit supply using a frequency approach, instead of a run approach, thus not requiring a diachronic graph. By so doing, intra and inter modal congesti...

Efficiency of Dynamic Task Assignment in Multi - User

Task farming is an important paradigm for parallel programming in multi-user environments. This paper proves two theorems about lower bounds for the efficiency of task farming programs in multi-user environments, using a generalization of the conventional definition of efficiency and Markov processes to model the behavior of other users. The results are illustrated and compared with simulation ...